Generalizing the powerset construction, coalgebraically
نویسندگان
چکیده
Coalgebra is an abstract framework for the uniform study of different kinds of dynamical systems. An endofunctor F determines both the type of systems (F-coalgebras) and a notion of behavioral equivalence (∼F) amongst them. Many types of transition systems and their equivalences can be captured by a functor F. For example, for deterministic automata the derived equivalence is language equivalence, while for non-deterministic automata it is ordinary bisimilarity. The powerset construction is a standard method for converting a nondeterministic automaton into an equivalent deterministic one as far as language is concerned. In this paper, we lift the powerset construction on automata to the more general framework of coalgebras with structured state spaces. Examples of applications include partial Mealy machines, (structured) Moore automata, and Rabin probabilistic automata.
منابع مشابه
Generalizing determinization from automata to coalgebras
The powerset construction is a standard method for converting a nondeterministic automaton into a deterministic one recognizing the same language. In this paper, we lift the powerset construction from automata to the more general framework of coalgebras with structured state spaces. Coalgebra is an abstract framework for the uniform study of different kinds of dynamical systems. An endofunctor ...
متن کاملCoalgebraic Walks, in Quantum and Turing Computation
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of a monad (powerset and distribution), in an obvious manner. It is shown that also quantum walks are coalgebras of a new monad, involving additional control structure. This new monad is also used to describe Turing mac...
متن کاملCoalgebraic Behavioral Metrics
We study different behavioral metrics, such as those arising from both branching and linear-time semantics, in a coalgebraic setting. Given a coalgebra $\alpha\colon X \to HX$ for a functor $H \colon \mathrm{Set}\to \mathrm{Set}$, we define a framework for deriving pseudometrics on $X$ which measure the behavioral distance of states. A crucial step is the lifting of the functor $H$ on $\mathrm{...
متن کاملUniform Random Generation for the Powerset Construction
An algorithm for the uniform random generation of the powerset construction is presented. Given a combinatorial class I, together with a counting procedure and an unranking procedure (or simply a random generation procedure) for I, this algorithm provides counting and unranking (or random generation) procedures for P = powerset(I). For most combi-natorial structures, each random powerset of siz...
متن کاملSEN - 1004 ) 10 th International Workshop on Coalgebraic Methods in Computer Science
The powerset construction is a standard method for converting a non-deterministic automaton into an equivalent deterministic one as far as language is concerned. In this short paper, we lift the powerset construction on automata to the more general framework of coalgebras with enriched state spaces. Examples of applications includes transducers, and Rabin probabilistic automata.
متن کامل